Involutive Directions and New Involutive Divisions

نویسنده

  • Yu-Fu CHEN
چکیده

In this paper, we propose the concept of involutive direction ss a vector representation for the concept of involutive division proposed by Gerdt and hi co-workers. With this representation, most of the properties of involutive divisions such as Noetherity, Artinity, and constructivity, can be greatly simplified. A new algorithm to compute the involutive completion is also given. Based on the vector representation, two new types of involutive divisions are found and proved to be Noetherian, Artinian, and constructive. These new divisions may lead to new methods of finding integrability conditions of partial differential equations and computing Grobner bases of polynomial ideals. @ 2001 Elsevier Science Ltd. All rights reserved. Keywords-Involutive divisions, Involutive directions, Grijbner bases, Nonmultiplier prolongation, Involutive completion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Involutive Division Technique: Some Generalizations and Optimizations

In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them allows one to compute an involutive Gröbner basis of a polynomial ideal by sequentially examining multiplicative reductions of nonmultiplicative prolongations....

متن کامل

On Noncommutative Involutive Divisions

Buchberger’s algorithm for computing a Gröbner basis solves the ideal membership problem over commutative polynomial rings. In the early 1990’s, an alternative to this algorithm was found, namely the involutive basis algorithm, which provides a Gröbner basis with extra combinatorial properties. Buchberger’s work was generalised to noncommutative polynomial rings by Bergman and Mora during the 1...

متن کامل

Involutive Divisions in Mathematica: Implementation and Some Applications

In this paper we consider diierent involutive divisions and describe their implementation in Mathematica together with algorithms for the construction of involutive bases for monomial ideals. As a straightforward application, we consider computation of the Hilbert function and the Hilbert polynomial for a monomial ideal, or for a polynomial one represented by its Grr obner basis. This allows on...

متن کامل

The Theory of

Generalising the divisibility relation of terms we introduce the lattice of so-called involutive divisions and de ne the admissibility of such an involutive division for a given set of terms. Based on this theory we present a new approach for building up a general theory of involutive bases of polynomial ideals. In particular, we give algorithms for checking the involutive basis property and fo...

متن کامل

Involutive Bases of Polynomial Ideals

In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial the self-consistent separation of the whole set of variables into two disjoint subsets. They are cal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001